package leetcode.toend;

public class T1893 {
    class Solution {
        public boolean isCovered(int[][] ranges, int left, int right) {
            boolean[] dp=new boolean[51];
            for(int i=0;i<ranges.length;i++){
                for(int j=ranges[i][0];j<=ranges[i][1];j++){
                    dp[j]=true;
                }
            }
            for(int i=left;i<=right;i++){
                if(!dp[i]){
                    return false;
                }
            }
            return true;
        }
    }
}
